A class of multiple-criteria fractional programming problems
نویسندگان
چکیده
منابع مشابه
Global Optimization Algorithms for a Class of Fractional Programming Problems
This paper addresses the problem of minimizing a sum of fractional functions over a convex set, where each fractional function is described by the ratio between a convex and a concave function. Linear-fractional programming problems fall into this category as important special cases. Two global optimization algorithms based on a suitable reformulation of the problem in the outcome space are pro...
متن کاملMultiple Solutions for a Class of Fractional Boundary Value Problems
and Applied Analysis 3 Definition 2.2 see 8 . Let f t be a function defined on a, b . The left and right RiemannLiouville fractional derivatives of order τ for function f t denoted by aDτbf t and tD τ bf t , respectively, are defined by aD τ t f t d dtn aD τ−n t f t 1 Γ n − τ d dtn (∫ t a t − s n−τ−1f s ds ) , tD τ bf t −1 n d dtn tD τ−n b f t 1 Γ n − τ d dtn (∫b t t − s n−τ−1f s ds ) , 2.2 whe...
متن کاملA necessary condition for multiple objective fractional programming
In this paper, we establish a proof for a necessary condition for multiple objective fractional programming. In order to derive the set of necessary conditions, we employ an equivalent parametric problem. Also, we present the related semi parametric model.
متن کاملA New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1986
ISSN: 0022-247X
DOI: 10.1016/0022-247x(86)90034-x